Gap between upward and tollbooth instances
نویسندگان
چکیده
We show that the gap in profit between a naturally defined upward instance of the tollbooth problem on a tree and the original instance can be at least Ω(log log n) where n is the number of edges in the tree.
منابع مشابه
On the tollbooth problem
We show that the gap in profit between a naturally defined upward instance of the tollbooth problem on a tree and the original instance can be at least Ω(log log n) where n is the number of edges in the tree.
متن کاملProfit-maximizing pricing for tollbooths
The input to the tollbooth problem is a graph G = (V,E) and a set of m buyers Pi where each buyer is interested in buying a path Pi connecting si, ti ∈ V . Each buyer comes with a budget b(Pi), a positive real number. The problem is to set non-negative prices to the edges E of G. A buyer buys her path Pi if the sum of prices on Pi is at most her budget. If a buyer buys her path, we obtain a pro...
متن کاملObject-Oriented Simulation Model for Tandem Tollbooth Operations using Pro-Model
This paper presents a new object-oriented simulation model to describe tandem tollbooth system in order to evaluate the operational performance of toll plaza facilities. This microscopic traffic simulation model is used to enhance planning, design, operations, and management of traffic operation at toll plazas. Computational result shows that lower reaction time ratio increases the throughput c...
متن کاملOn the minimization of traffic congestion in road networks with tolls
Population growth and the massive production of automotive vehicles have lead to the increase of traffic congestion problems. Traffic congestion today is not limited to large metropolitan areas, but is observed even in medium-sized cities and highways. Traffic engineering can contribute to lessen these problems. One possibility, explored in this paper, is to assign tolls to streets and roads, w...
متن کاملOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In the tollbooth problem, we are given a tree T = (V,E) with n edges, and a set of m customers, each of whom is interested in purchasing a path on the tree. Each customer has a fixed budget, and is willing to pay at most her budget to purchase her path. The objective of the problem is to price the edges of T such that the total revenue made by selling the paths to the customers that can afford ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011